.TH Example 3 "" "" "AiSD"

.SH NAME

hanoi - print sequence for the tower of Hanoi (the puzzle) 

.SH SYNOPSIS

hanoi n

.SH DESCRIPTION
Given a stack of n disks, the towers of Hanoi puzzle asks for the minimum number of moves required to move the stack from one rod to another, where moves are allowed only if they place smaller disks on top of larger disks. For n=3 print sequence: 1, 2, 1, 3, 1, 2, 1
